计算机与现代化 ›› 2013, Vol. 1 ›› Issue (9): 1-7.doi: 10.3969/j.issn.1006-2475.2013.09.001

• 人工智能 •    下一篇

基于领域本体的语义搜索——带权最短路径方法

王 曼,吴振忠   

  1. 华南师范大学计算机学院,广东 广州 510631
  • 收稿日期:2013-03-28 修回日期:1900-01-01 出版日期:2013-09-17 发布日期:2013-09-17

Domain Ontology-based Semantic Search: Weighted Shortest Path Method

WANG Man, WU Zhen-zhong   

  1. School of Computer Science, South China Normal University, Guangzhou 510631, China
  • Received:2013-03-28 Revised:1900-01-01 Online:2013-09-17 Published:2013-09-17

摘要: 目前流行的信息搜索方法大都基于关键字的匹配,尽管已经出现了赋予文档、查询语句语义含义的检索模型,但这些模型本质上是从句形相关度的匹配转变为词汇语义相关度的匹配。由于现存本体差异性大,定义的语义质量参差不齐,且缺乏一种高效的知识发现、常识推理的机制,使得根据用户的真正意图进行语义搜索变得困难。本文以搜索计算机领域中的科技文献为例,提出一种新颖的本体和图论结合的检索方法,用计算机领域本体表示文档中的知识,用求带权最短路径的方法扩展查询,从而推断出用户的真正意图,在搜索过程中,综合考虑句形和语义两种因素进行匹配查询,根据语义相似度排序相关文档。通过标准的固定数据集测试证明,该模型能有效地提高查询准确率。

关键词: 语义搜索, 领域本体, 语义网络, 查询扩展

Abstract: The most popular methods about information retrieval are based on keywords matching so far. Despite the search models which can indicate the meaning of documents and queries have emerged, they simply match the similarity of vocabulary semantically instead of lexically. However, the huge difference among existing ontologies and the various definitions of semantics with uneven qualities lead to the difficulties in semantic searching by user intention. Therefore, an efficient mechanism working on knowledge discovery and commonsense reasoning is extremely needed. This paper proposes a novel retrieval method combining ontology with graph theory. To infer the user intention, it presents the knowledge of documents using computer domain ontology and expands the queries in the shortest path of semantic network. In the search process, it ranks the documents based on both factors of lexical and semantic similarities. This model is proven efficient in improving the accuracy of retrieval through a testing of standard dataset.

Key words: semantic search, domain ontology, semantic network, query expansion

中图分类号: